منابع مشابه
Topological complexity of locally finite omega -languages
Locally finite omega languages were introduced by Ressayre in [Formal Languages defined by the Underlying Structure of their Words, Journal of Symbolic Logic, 53, number 4, December 1988, p. 1009-1026]. These languages are defined by local sentences and extend ω-languages accepted by Büchi automata or defined by monadic second order sentences. We investigate their topological complexity. All lo...
متن کاملClosure properties of locally finite omega-languages
Locally finite ω-languages, defined via second order quantifications followed by a first order locally finite sentence, were introduced by Ressayre in [Res88]. They enjoy very nice properties and extend ω-languages accepted by finite automata or defined by monadic second order sentences. We study here closure properties of the family LOCω of locally finite omega languages. In particular we show...
متن کاملLocally finite basic classical simple Lie superalgebras
In this work, we study direct limits of finite dimensional basic classical simple Lie superalgebras and obtain the conjugacy classes of Cartan subalgebras under the group of automorphisms.
متن کاملLocally Chain-Parsable Languages
If a context-free language enjoys the local parsability property then, no matter how the source string is segmented, each segment can be parsed independently, and an efficient parallel parsing algorithm becomes possible. The new class of locally chain-parsable languages (LCPL), included in deterministic context-free languages, is here defined by means of the chain-driven automaton and character...
متن کاملOn locally reversible languages
There exist several works that study the class of reversible languages defined as the union closure of 0-reversible languages, their properties and suitable representations. In this work we define and study the class of locally reversible languages, defined as the union closure of k-reversible languages. We characterize the class and prove that it is a local (positive) variety of formal languag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00286-8